Improved Approximation Algorithms for the Single-Sink Buy-at-Bulk Network Design Problems
نویسندگان
چکیده
منابع مشابه
Cost-Distance: Two Metric Network Design
We present the COST-DISTANCE problem: finding a Steiner tree which optimizes the sum of edge costs along one metric and the sum of source-sink distances along an unrelated second metric. We give the first known randomized approximation scheme for COST-DISTANCE, where is the number of sources. We reduce several common network design problems to COST-DISTANCE, obtaining (in some cases) the first ...
متن کاملNetwork Design via Core Detouring for Problems without a Core
Some of the currently best-known approximation algorithms for network design are based on random sampling. One of the key steps of such algorithms is connecting a set of source nodes to a random subset of them. In a recentwork [Eisenbrand,Grandoni,Rothvoß,Schäfer-SODA’08], a new technique, core-detouring, is described to bound the mentioned connection cost. This is achieved by defining a sub-op...
متن کاملApproximation Algorithms for Network Design Problems with Node Weights
We consider several fundamental network design problems in undirected graphs with weights (costs) on both edges and nodes. We obtain the first poly-logarithmic approximation ratios for some classical problems that have been studied in the edge-weighted setting. Our main results are the following. • An O(log n) approximation for the Steiner forest problem. • An O(log n) approximation for the sin...
متن کاملSingle-Sink Network Design with Vertex Connectivity Requirements
We study single-sink network design problems in undirected graphs with vertex connectivity requirements. The input to these problems is an edge-weighted undirected graph G = (V, E), a sink/root vertex r, a set of terminals T ⊆ V, and integer k. The goal is to connect each terminal t ∈ T to r via k vertex-disjoint paths. In the connectivity problem, the objective is to find a min-cost subgraph o...
متن کاملImproved Approximation for Single-Sink Buy-at-Bulk
In the single-sink buy-at-bulk network design problem we are given a subset of source nodes in a weighted undirected graph: each source node wishes to send a given amount of flow to a sink node. Moreover, a set of cable types is given, each characterized by a cost per unit length and by a capacity: the ratio cost/capacity decreases from small to large cables by economies of scale. The problem i...
متن کامل